/*
===========================================================================
This source file is part of DyLab (Dynamic Laboratory)
For the latest info, see http://dylab.googlecode.com

Copyright (c) 2006-2008 Lukas Krejci
(krejci.lukas@volny.cz)

This file is part of DyLab.

    DyLab is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    DyLab is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with DyLab.  If not, see <http://www.gnu.org/licenses/>.
===========================================================================
*/

#ifndef __dylab_QueueContainer_h__
#define __dylab_QueueContainer_h__

//===========================================================================================
#include <queue>

//===========================================================================================
#include <dylab/utils/containers/ContainerBase.h>

//===========================================================================================
namespace dylab {

    /** 
     */    
    template < 
        typename _ValueT
    >
    class QueueContainer
        : public ContainerBase<std::queue<_ValueT> >
    {
    public:
        typedef std::queue<_ValueT> STLqueueT;
    public:
        /// scoped reader class
        class Reader 
            : public ReaderBase
        {
        public:
            Reader(const ContainerBaseT & _c)
                : ReaderBase(_c)
                    { }
            bool empty() const
                    { return mSTLcontainer->empty(); }
            const _ValueT & front() const
                    { return mSTLcontainer->front(); }
            const _ValueT & back() const
                    { return mSTLcontainer->back(); }
        };
        //-----------------------------------------------------------------------------
    public:
        /// scoped writer class
        class Writer
            : public WriterBase
        {
        public:
            Writer(ContainerBaseT & _c)
                : WriterBase(_c)
                    { }
            void removeAll()
                { while (!mSTLcontainer->empty()) mSTLcontainer->pop(); }
            void push(_ValueT t)
                    { mSTLcontainer->push(t); }
            void pop()
                    { mSTLcontainer->pop(); }
            _ValueT & front()
                    { return mSTLcontainer->front(); }
            _ValueT & back()
                    { return mSTLcontainer->back(); }
        };
        //-----------------------------------------------------------------------------

    public:

        bool isEmpty() const
                { return Reader(*this).empty(); }
              
        _ValueT & front()
                { return Writer(*this).front(); }
        const _ValueT & front() const
                { return Reader(*this).front(); }

        _ValueT & back()
                { return Writer(*this).back(); }
        const _ValueT & back() const
                { return Reader(*this).back(); }


        void push(_ValueT _value)
                { Writer(*this).push(_value); }
        void pop()
                { Writer(*this).pop(); }
        void removeAll()
                { Writer(*this).removeAll(); }
    };
}
//===========================================================================================
#endif // __dylab_QueueContainer_h__
